A Smoothing Technique for the Minimum Norm Solution of Absolute Value Equation
نویسندگان
چکیده مقاله:
One of the issues that has been considered by the researchers in terms of theory and practice is the problem of finding minimum norm solution. In fact, in general, absolute value equation may have infinitely many solutions. In such cases, the best and most natural choice is the solution with the minimum norm. In this paper, the minimum norm-1 solution of absolute value equation is investigated. By applying the augmented Lagrangian method, this problem can be reduced to an unconstrained optimization problem with once differentiable objective function. To use Newton method, we apply the smoothing techniques. Computational results show that convergence to high accuracy often occurs in just a few iterations.
منابع مشابه
A note on unique solvability of the absolute value equation
It is proved that applying sufficient regularity conditions to the interval matrix $[A-|B|,A + |B|]$, we can create a new unique solvability condition for the absolute value equation $Ax + B|x|=b$, since regularity of interval matrices implies unique solvability of their corresponding absolute value equation. This condition is formulated in terms of positive deniteness of a certain point matrix...
متن کاملAbsolute value equation solution via dual complementarity
By utilizing a dual complementarity condition, we propose an iterative method for solving the NPhard absolute value equation (AVE): Ax−|x| = b, where A is an n×n square matrix. The algorithm makes no assumptions on the AVE other than solvability and consists of solving a succession of linear programs. The algorithm was tested on 500 consecutively generated random solvable instances of the AVE w...
متن کاملLinear complementarity as absolute value equation solution
We consider the linear complementarity problem (LCP): Mz + q ≥ 0, z ≥ 0, z′(Mz + q) = 0 as an absolute value equation (AVE): (M + I)z + q = |(M − I)z + q|, where M is an n× n square matrix and I is the identity matrix. We propose a concave minimization algorithm for solving (AVE) that consists of solving a few linear programs, typically two. The algorithm was tested on 500 consecutively generat...
متن کاملAbsolute Value Equation Solution Via Linear Programming
By utilizing a dual complementarity property, we propose a new linear programming method for solving the NP-hard absolute value equation (AVE): Ax−|x| = b, where A is an n×n square matrix. The algorithm makes no assumptions on the AVE other than solvability and consists of solving a few linear programs, typically less than four. The algorithm was tested on 500 consecutively generated random sol...
متن کاملAbsolute value equation solution via concave minimization
The NP-hard absolute value equation (AVE) Ax − |x| = b where A ∈ R and b ∈ Rn is solved by a succession of linear programs. The linear programs arise from a reformulation of the AVE as the minimization of a piecewise-linear concave function on a polyhedral set and solving the latter by successive linearization. A simple MATLAB implementation of the successive linearization algorithm solved 100 ...
متن کاملSolving absolute value equation using complementarity and smoothing functions
In this paper, we reformulate the NP-hard problem of the absolute value equation (AVE) as a horizontal linear complementarity one and then solve it using a smoothing technique. This approach leads to a new class of methods that are valid for general absolute value equation. An asymptotic analysis proves the convergence of our schemes and provides some interesting error estimates. This kind of e...
متن کاملمنابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ذخیره در منابع من قبلا به منابع من ذحیره شده{@ msg_add @}
عنوان ژورنال
دوره 16 شماره 1
صفحات 1- 9
تاریخ انتشار 2019-04
با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.
کلمات کلیدی برای این مقاله ارائه نشده است
میزبانی شده توسط پلتفرم ابری doprax.com
copyright © 2015-2023